Combinatorial modulus, the combinatorial Loewner property, and Coxeter groups
نویسندگان
چکیده
منابع مشابه
[ m at h . G R ] 3 M ay 2 01 1 COMBINATORIAL MODULUS , THE COMBINATORIAL LOEWNER PROPERTY , AND COXETER GROUPS
We study combinatorial modulus on self-similar metric spaces. We give new examples of hyperbolic groups whose boundaries satisfy a combinatorial version of the Loewner property, and prove Cannon’s conjecture for Coxeter groups. We also establish some connections with lp-cohomology.
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملCombinatorial Proofs of Bivariate Generating Functions on Coxeter Groups
McMahon’s result that states the length and major index statistics are equidistributed on the symmetric group Sn has generalizations to other Coxeter groups. Adin, Brenti and Roichman have defined analogues of those statistics for the hyperoctahedral group, Bn and proved equidistribution theorems. Using combinatorial interpretations of Regev and Roichman’s statistics length and delent, we consi...
متن کاملSome Combinatorial Aspects of Reduced Words in Finite Coxeter Groups
We analyze the structure of reduced expressions in the Coxeter groups An, Bn and Dn. Several special classes of elements are singled out for their connections with symmetric functions or the theory of P -partitions. Membership in these special classes is characterized in a variety of ways, including forbidden patterns, forbidden subwords, and by the form of canonically chosen reduced words.
متن کاملCombinatorial Property Vs Computational Property
A set C can be strongly coded under condition < B, C(A) >, where B and C are classes of sets possibly with other parameters, iff there exists A ∈ B such that every Z ∈ C(A) can be used to compute C. The issue is widely studied especially in effective mathematics and reverse mathematics. In this paper, we focus on three kinds of conditions, namely, density condition, enumeration condition and pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2013
ISSN: 1661-7207
DOI: 10.4171/ggd/177